Shared memory parallelism for 3D Cartesian discrete ordinates solver
نویسندگان
چکیده
منابع مشابه
An Improved Parallelism Scheme for Deterministic Discrete Ordinates Transport
In this paper we demonstrate techniques for increasing the node-level parallelism of a deterministic discrete ordinates neutral particle transport algorithm on a structured mesh to exploit many-core technologies. Transport calculations form a large part of the computational workload of physical simulations and so good performance is vital for the simulations to complete in reasonable time. We w...
متن کاملAnd-Or Parallelism on Shared-Memory Multiprocessors
D This paper presents an extended and-or tree and an extended WAM (Warren Abstract Machine) for efficiently supporting both and-parallel and or-parallel execution of logic programs on shared-memory multiprocessors. Our approach for exploiting both andand or-parallelism is based on the binding-arrays method for or-parallelism and the RAP (Restricted And-Parallelism) method for and-parallelism, t...
متن کاملAnd-Or Parallelism on Shared-Memory Multiprocessorsy
This paper presents an extended and-or tree and an extended WAM (Warren Abstract Machine) for eeciently supporting both and-parallel and or-parallel execution of logic programs on shared-memory multiprocessors. Our approach for exploiting both and-and or-parallelism is based on the binding-arrays method for or-parallelism and the RAP (Restricted And-Parallelism) method for and-parallelism, two ...
متن کاملAdaptive Parallelism in Distributed Shared Memory Environments
Workstations in networks of workstations (NOWs) are sometimes little used, especially in multi-user environments. Employing their compute power for parallel processing when not used otherwise is an attractive venture, if a practical means to do so can be found. In non-dedicated NOW environments, individual machines become available or unavailable as the workstation “owner” goes away or returns,...
متن کاملDeterministic Consistency: A Programming Model for Shared Memory Parallelism
The difficulty of developing reliable parallel software is generating interest in deterministic environments, where a given program and input can yield only one possible result. Languages or type systems can enforce determinism in new code, and runtime systems can impose synthetic schedules on legacy parallel code. To parallelize existing serial code, however, we would like a programming model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Nuclear Energy
سال: 2015
ISSN: 0306-4549
DOI: 10.1016/j.anucene.2014.08.034